#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
using ll = long long;
const int N = 2010, mod = 998244353;
ll fact[N], infact[N];
int n, m, k;
ll qmi(ll a, ll k)
{
    ll res = 1;
    while (k)
    {
        if (k & 1) res = res * a % mod;
        a = a * a % mod;
        k >>= 1;
    }
    return res;
}
int main()
{
    cin >> n >> m >> k;
    fact[0] = infact[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        fact[i] = fact[i - 1] * i % mod;
        infact[i] = infact[i - 1] * qmi(i, mod - 2) % mod;
    }
    cout << m * fact[n - 1] % mod * infact[n - k - 1] % mod * infact[k] % mod * qmi(m - 1, k) % mod << endl;
    return 0;
}